class Solution(object):
    def eliminateMaximum(self, dist, speed):
        n = len(dist)
        time = [(dist[i] - 1) // speed[i] for i in range(n)]
        time.sort()
        index = 1
        while index < n:
            if time[index] < index:
                return index
            else:
                index += 1
        return n




